//	ID : pallab81
// 	PROG : 10036_2
// 	LANG : C++
// 	2011-09-01-17.56.11 Thursday
//
// 	"I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define fo(i,st,ed) for(int i = st ; i < ed ; ++i )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )

inline void wait( double seconds ) {
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ) {
        ;
    }
}
int N,K;
int w[10001];
int dp[2][101];

inline int modifiedMod(int num, int mod) {
    int var = num%mod;
    if( var < 0)var+=mod;
    return var;
}
inline void Read() {
    CI(N);
    CI(K);
    fo(i,0,N) {
        CI(w[i]);
    }
}
inline void Proc() {
    foE(j,0,K) {
        dp[0][j]=dp[1][j]=0;
    }
    dp[0][ modifiedMod(w[0],K) ]=1;

    fo(i,1,N) {
        foE(j,0,K) {
            if( dp[0][j]==1 ) {
                // add kore
                int var1 = (j+w[i]);
                // substract kore
                int var2 = (j-w[i]);

                dp[1][ modifiedMod(var1,K) ]=1;
                dp[1][ modifiedMod(var2,K) ]=1;
            }

        }
        foE(j,0,K) {
            dp[0][j]=dp[1][j];
            dp[1][j]=0;
        }
    }



    if(dp[0][0]) {
        cout<<"Divisible\n";
        return ;
    }

    cout<<"Not divisible\n";

}

int main() {
//#ifndef ONLINE_JUDGE
//    freopen("in.txt","rt",stdin);
//#endif

    int cases=1;
    for( CI(cases) ; cases ; --cases ) {
        Read();
        Proc();
    }

    return 0;
}
